Universal Access To All Knowledge
Home Donate | Store | Blog | FAQ | Jobs | Volunteer Positions | Contact | Bios | Forums | Projects | Terms, Privacy, & Copyright
Search: Advanced Search
Anonymous User (login or join us)
Upload
Search Results
Results: 1 through 50 of 172 (0.001 secs)
You searched for: mediatype:education AND collection:msri AND subject:"Lecture"
[1] 2 3 4     Next    Last
[unknown]Combinatorial Methods in Low-Dimensional Topology 3
Speaker : Cameron Gordon
Keywords: Mathematics; lecture
Downloads: 304
[unknown]Setting the Stage: Surgery in the Sixties
Speaker : Andrew Casson
Keywords: Mathematics; lecture
Downloads: 170
[unknown]Modular Forms and Residually Reducible Representations, II
Speaker : Chris Skinner
Keywords: Mathematics; lecture
Downloads: 96
[unknown]Expected Length of the Longest Common Subsequence for Large Alphabet
Speaker : Marcos Kiwi Keywords : Analysis of algorithms; longest common subsequence; Sankoff & Mainville conjecture; longest increasing sequence; random graphs. Abstract : We consider the length L of the longest common subsequence of two randomly, uniformly and independently chosen n. We prove conjecture of Sankoff and Mainville from the early 80's concerning the asympotic (in k) behavior limiting constant.
Keywords: Mathematics; lecture
Downloads: 269
[unknown]Approximate Indexing with Tries.
Speaker : Mortiz Maass Keywords : Analysis of algorithms; approximate pattern matching; tries; average-case analysis; humming distance; indexing. Abstract : We analyze the asympotic average -case behavior of a search process in random tries. A pattern is searched in a set of strings under a certain pair-based error function. Error functions are possible. We find different asympotic behavior dependent on the error probability and the number of mismatches allowed.
Keywords: Mathematics; lecture
Downloads: 199
[unknown]On the Average-Case Complexity of Groebner Basis
NOTE: no sound in first 20 seconds Speaker : Bruno Salvy Keywords : Analysis of algorithms; Grobner bases; generic complexity; coalescence of saddle-points. Abstract : While the computation of Grobner bases is known to be an exsapace complete problem, the generic behavior of the algorithms for their bases and analyze precisely the best algorithm currently known.
Keywords: Mathematics; lecture
Downloads: 321
[unknown]Tree Representations for Boolean Formulae with Commutativity and Associativity.
Speaker : Daniele Gardy Keywords: Analysis of algorithms; Boolean function representation; probability distributions on boolean functions. Abstract: We study several tree representations of boolean functions, to take into account commutativity or associativity of the boolean operators. We show how we can define related probability distributions on boonlean functions, and study some relationships between these distributions...
Keywords: Mathematics; lecture
Downloads: 202
[unknown]Fields with Pseudo-Exponentiation
Speaker : Boris Zil'ber
Keywords: Mathematics; lecture
Downloads: 175
[unknown]Oscillatory Integrals of Nonlinear PDE, V
Speaker : Carlos Kenig
Keywords: Mathematics; lecture
Downloads: 294
[unknown]Some (counter) Examples in O-Minimality, I & II
Speaker : Alex Wilkie
Keywords: Mathematics; lecture
Downloads: 252
[unknown]Combinatorial Methods in Low-Dimensional Topology 4
Speaker : Cameron Gordon
Keywords: Mathematics; lecture
Downloads: 200
[unknown]Analytic Information Theory: Hidden Markov Processes.
Speaker : Philippe Jacquet
Keywords: Mathematics; lecture
Downloads: 595
[unknown]Euclidean Dynamics.
Speaker : Bridgitte Vallee Keywords: Analysis of algorithms; Euclidean algorithms; continued fraction expansion; dynamical systems; transfer operators; central and local limit theorems. Abstract: We show how dynamical analysis (=analysis of algorithms and dynamical systems) applies to the Euclidean context and provides a very precise distributional analysis of Euclidean algorithms. It proves that, in a strong sense, Euclidean algorithms are Gaussian.
Keywords: Mathematics; lecture
Downloads: 283
[unknown]On the Modularity of Rational Elliptic Curves, II: Filtered Phi_1 Modules
Speaker : Christophe Breuil
Keywords: Mathematics; lecture
Downloads: 174
[unknown]Hilbert's Approach and Galois Groups Over k(t)
Speaker : Matzat
Keywords: Mathematics; lecture
Downloads: 229
[unknown]The Haplotype Phasing Problem
Speaker : Richard Karp
Keywords: Mathematics; lecture
Downloads: 418
[unknown]Maximum Flow Through a Random Network: An Illustration of the Cavity Method.
Speaker : David Aldous
Keywords: Mathematics; lecture
Downloads: 215
[unknown]Diagonal Polya Processes
Speaker : Hosam Mahmoud Keywords : Analysis of algorithms; Poly urn; stochastic process embedding; Poissonization; Leonard pair. Abstract : We take a view of Urn models that abandons the picking of balls from an urn and considers embedded versions into a Poisson process. A connection to partial differential equations is discussed and exact and asympotic solutions are presented for diagonal cases.
Keywords: Mathematics; lecture
Downloads: 178
[unknown]Combinatorial Approach to Quantizations of Lie Algebras, A
Speaker : Vladislav Kharchenko
Keywords: Mathematics; lecture
Downloads: 173
[unknown]More Results on Priority Trees
Speaker : Alois Panholzer Keywords: Analysis of algorithms; Grobner bases; generic complexity; coalescence of saddle-points. Abstract: While the computation of Grobner bases is known to be an exsapace complete problem, the generic behavior of the algorithms for their bases and analyze precisely the best algorithm currently known.
Keywords: Mathematics; lecture
Downloads: 133
[unknown]On the Modularity of Certain 2-adic Galois Representations
Speaker : Mark Dickinson
Keywords: Mathematics; lecture
Downloads: 100
[unknown]Rigidity and Embedding Problems
Speaker : Mazat
Keywords: Mathematics; lecture
Downloads: 186
[unknown]Analytic Urns Of Triangular Forms.
Speaker : Vincent Puyhaubert Keywords : Analysis of algorithms; analytic urns, stable limit law, Mellin transform, Fubini theorem, Event generating function, Convergence in distribution Abstract : We present an analytic approach to urn models. The method is the same as in Flajolet-Gabarro-Pekari wich consists in enumerating all events starting from an initial urn. A PDE is obtained for the generating function wich is solved by method of characteristics...
Keywords: Mathematics; lecture
Downloads: 153
[unknown]That Marvelous Torus
Speaker : Robert Edwards
Keywords: Mathematics; lecture
Downloads: 166
[unknown]Modularity of Q-Curves
Speaker : Jordan Ellenberg
Keywords: Mathematics; lecture
Downloads: 132
[unknown]Generalizing the Kraft-McMillan Inequality to Restricted Languages.
Speaker : Mordecai Golin Keywords : Analysis of algorithms; Information theory, Kraft McMillan Inequality, Source Coding Abstract : Given a fixed alphabet, a "prefix-code" is a set of words built from the alphabet such that no word in the set is a prefix of any other word in the set. The "Level-Sequence" of a code is a sequence of non-negative integers, in which the i'th integer is the number of words of length i in the code...
Keywords: Mathematics; lecture
Downloads: 232
[unknown]Recent Developments in Harmonic Analysis, III
Speaker : Ana Vargas
Keywords: Mathematics; lecture
Downloads: 214
[unknown]Geometry of Syzygies, III
Speaker: David Eisenbud
Keywords: Mathematics; lecture
Downloads: 271
[unknown]Introduction to Moduli of Stable Curves 2
Speaker : Raynaud
Keywords: Mathematics; lecture
Downloads: 147
[unknown]Geometric Measure Theory, Harmonic Analysis and Potential Theory, II
Speaker : Tatiana Toro
Keywords: Mathematics; lecture
Downloads: 299
[unknown]Computation by Symmetry Operations in a Structured Neural Model of the Brain Music & Abstract Reasoning
Speaker : Gordon Shaw
Keywords: Mathematics; lecture
Downloads: 259
[unknown]Rigidity and Embedding Problems
Speaker : Mazat
Keywords: Mathematics; lecture
Downloads: 99
[unknown]Other Applications of Branched Coverings
Speaker : Elkies
Keywords: Mathematics; lecture
Downloads: 158
[unknown]Applications of Applied Mathematics Methods to the Analysis of Algorithms and Trees Properties
Speaker : Chuck Knessl Keywords : Analysis of algorithms; Asympotics; WKB method; digital trees; quicksort; binary search trees; matched asympotic expansions. Abstract : We apply singular perturbation techniques to the analysis of algorithms and to trees. Examples include digital tress, binary search trees and quicksort algorithm.
Keywords: Mathematics; lecture
Downloads: 329
[unknown]On an Approach to a Non-Abelian Class field Theory for Cyclotomic Towers
Speaker : Kazuhiro Fujiwara
Keywords: Mathematics; lecture
Downloads: 155
[unknown]Geometric Combinatorics - MinkowskiÂ’s Theorem
Speaker: Francis Su
Keywords: Mathematics; lecture
Downloads: 241
[unknown]Upper Bounds on the number of Scattering Poles
Speaker: Plamen Stefanov
Keywords: Mathematics; lecture
Downloads: 184
[unknown]Four Martingales in Binary Search Trees.
Speaker : Bridgitte Chauvin
Keywords: Mathematics; lecture
Downloads: 261
[unknown]Some Curious Symplectic and Non-Symplectic 4-Manifolds.
Speaker : Ron Stern
Keywords: Mathematics; lecture
Downloads: 176
[unknown]On Partial Sorting
Speaker : Conrado Martinez Keywords: Analysis of algorithms; partial sorting; quicksort; quickselect; divide and conquer recurrences. Abstract: In this lecture I present a preliminary analysis of partial quicksort, a simple variant of quicksort which efficiently solves the partial sort problem. I also present similar results for chunksort, another generalization of quicksort which can be used to sort designated intervals of an array.
Keywords: Mathematics; lecture
Downloads: 247
[unknown]Suffix Trees and Simple Sources
Speaker : Julien Fayolle
Keywords: Mathematics; lecture
Downloads: 139
[unknown]Optimization and Interior Point Methods, Part 2
Speaker : Jim Renegar
Keywords: Mathematics; lecture
Downloads: 173
[unknown]Redundant-Number Systems and Applications in Cryptology
Speaker : Helmut Prodinger Keywords: Analysis of algorithms; redundant number representation; simple joint sparse form; non-adjacent form.
Keywords: Mathematics; lecture
Downloads: 191
[unknown]Universal Types, Binary Trees, and Simulation of Individual Sequences.
Speaker : Gadiel Seroussi
Keywords: Mathematics; lecture
Downloads: 168
[unknown]Galois Action on the Projective Line Minus Three Points and Noncommutative Power Series
Speaker : Ihara
Keywords: Mathematics; lecture
Downloads: 155
[unknown]Real Algebraic Geometry, Part 3
Speaker : Michael Coste
Keywords: Mathematics; lecture
Downloads: 235
[unknown]Limit Theorms for Urn Models.
Speaker : Svante Janon Keywords: Analysis of algorithms; Urn models; generalized polya urns; multitype branching process. Abstract: Generalized polya urns are defined. Limit theorems are given, both in the irreducible and triangular cases. The limit is normal in some cases and not in others, depending on the relation between the egien values of the replacement & matrix. In the triangular case, stable and Mittar letter laws appear, too.
Keywords: Mathematics; lecture
Downloads: 217
[unknown]Birth of the Giant Component, The
Speaker : Donald Knuth
Keywords: Mathematics; lecture
Downloads: 1,305
[unknown]Geometric Measure Theory, Harmonic Analysis and Potential Theory, IV
Speaker : Tatiana Toro
Keywords: Mathematics; lecture
Downloads: 264
[unknown]The Profile and Height of log n Trees.
Speaker : Michael Drmota Keywords : Analysis of algorithms; random trees; profile height; limiting distribution; martingales; moment methods Abstract : The purpose of this talk is to surrey our results on the limiting behavior of the profile and height of various classes of random trees where the average depth is of order log n. In particular we focus on increasing trees and split trees that cover all common search trees.
Keywords: Mathematics; lecture
Downloads: 158
[1] 2 3 4     Next    Last
Advanced search

Group results by:

> Relevance
Mediatype
Collection

Refine your search:

File formats
MP3 files
Any audio file
Movie files
Images

Related collections

msri

Related creators

Related mediatypes

education